The weak core of simple games with ordinal preferences: implementation in Nash equilibrium
نویسندگان
چکیده
In a simple game, coalitions belonging to a given class are “absolutely powerful” while others have no power. We attempt to make this distinction operational. Toward this end, we propose two axioms on social choice correspondences, Strong Non-Discrimination and Exclusion. Strong NonDiscrimination describes circumstances under which certain coalitions, the losing coalitions, have no influence over social choice. Exclusion requires that there are situations in which certain coalitions, the winning coalitions, can exercise their power. We show that the weak core correspondence is the minimal correspondence satisfying Maskin Monotonicity and Strong Non-Discrimination. We also show that the weak core is the unique correspondence satisfying Nash implementability, Strong Non-Discrimination, and Exclusion. 2003 Elsevier Inc. All rights reserved. JEL classification: C71; C72; D71; D78
منابع مشابه
Nash Equilibrium Strategy for Bi-matrix Games with L-R Fuzzy Payoffs
In this paper, bi-matrix games are investigated based on L-R fuzzy variables. Also, based on the fuzzy max order several models in non-symmetrical L-R fuzzy environment is constructed and the existence condition of Nash equilibrium strategies of the fuzzy bi-matrix games is proposed. At last, based on the Nash equilibrium of crisp parametric bi-matrix games, we obtain the Pareto and weak Pareto...
متن کاملOrdinal Games
We study strategic games where players' preferences are weak orders which need not admit utility representations. First of all, we extend Voorneveld's concept of best-response potential from cardinal to ordinal games and derive the analogue of his characterization result: An ordinal game is a best-response potential game if and only if it does not have a best-response cycle. The characterizatio...
متن کاملHedonic coalition formation games: A new stability notion
This paper studies hedonic coalition formation games where each player’s preferences rely only upon the members of her coalition. A new stability notion under free exit-free entrymembership rights, referred to as strong Nash stability, is introducedwhich is stronger than both core and Nash stabilities studied earlier in the literature. Strong Nash stability has an analogue in non-cooperative ga...
متن کاملPure Nash Equilibrium in A Capacitated Resource Allocation Game with Binary Preferences
A resource allocation game with identical preferences is considered where each player, as a node of an undirected unweighted network, tries to minimize her cost by caching an appropriate resource. Using a generalized ordinal potential function, a polynomial time algorithm is devised in order to obtain a pure-strategy Nash equilibrium (NE) when the number of resources is limited or the network h...
متن کاملComputational aspects of Shapley's saddles
Game-theoretic solution concepts, such as Nash equilibrium, are playing an ever increasing role in the study of systems of autonomous computational agents. A common criticism of Nash equilibrium is that its existence relies on the possibility of randomizing over actions, which in many cases is deemed unsuitable, impractical, or even infeasible. In work dating back to the early 1950s Lloyd Shapl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Games and Economic Behavior
دوره 44 شماره
صفحات -
تاریخ انتشار 2003